<area shape="rect" href="$a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="5,293,83,317">
<area shape="rect" href="$a00002.html" title="Bellman Ford algorithm." alt="" coords="147,5,245,29">
<area shape="rect" href="$a00003.html" title="Breadth&#45;First&#45;Search (BFS) algorithm." alt="" coords="176,53,216,77">
<area shape="rect" href="$a00005.html" title="Dijkstra&#39;s Algorithm for computing a shortest path from a single source to a..." alt="" coords="151,101,241,125">
<area shape="rect" href="$a00008.html" title="Depth&#45;First&#45;Search (DFS) algorithm." alt="" coords="176,149,216,173">
<area shape="rect" href="$a00009.html" title="Dijkstra&#39;s Algorithm for computing single source shortest path." alt="" coords="164,197,228,221">
<area shape="rect" href="$a00012.html" title="Heuristic graph bi&#45;partitioning algorithm (Fiduccia&#45;Mattheyses)." alt="" coords="149,245,243,269">
<area shape="rect" href="$a00015.html" title="Maximum flow algorithm (Edmonds&#45;Karp)." alt="" coords="152,293,240,317">
<area shape="rect" href="$a00016.html" title="Maximum flow algorithm (Malhotra, Kumar, Maheshwari)." alt="" coords="149,341,243,365">
<area shape="rect" href="$a00017.html" title="Maximum flow algorithm with shortest augmenting paths." alt="" coords="147,389,245,413">
<area shape="rect" href="$a00018.html" title="Kruskal&#39;s algorithm for finding minimal spanning tree of a graph." alt="" coords="159,437,233,461">
<area shape="rect" href="$a00023.html" title="Tests if a graph can be drawn on a plane without any edge crossings." alt="" coords="160,485,232,509">
<area shape="rect" href="$a00025.html" title="Heuristic graph bi&#45;partitioning algorithm (Wei&#45;Cheng)." alt="" coords="132,533,260,557">
<area shape="rect" href="$a00026.html" title="ST&#45;number algorithm." alt="" coords="153,581,239,605">
<area shape="rect" href="$a00004.html" title="Biconnectivity&#45;test and low&#45;numbers." alt="" coords="309,101,413,125">
<area shape="rect" href="$a00007.html" title="Connected components algorithm." alt="" coords="315,149,408,173">
<area shape="rect" href="$a00028.html" title="Topological sorting." alt="" coords="329,197,393,221">
